package demo1;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 28779
 * Date: 2023-04-23
 * Time: 10:06
 */
public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();
        System.out.println("节点个数为：" + binaryTree.size1(root));
        System.out.println("节点个数为：" + binaryTree.size2(root));
        System.out.println("叶子节点个数为：" + binaryTree.getLeafNodeCount1(root));
        System.out.println("叶子节点个数为：" + binaryTree.getLeafNodeCount2(root));
        System.out.println("第k层节点个数为：" + binaryTree.getKLevelNodeCount(root, 3));
        System.out.println("数的深度为：" + binaryTree.getHeight(root));
        System.out.println("是否包含某个节点：" + binaryTree.find(root, 'W'));

    }
}
